Analysis of LP relaxations for multiway and multicut problems
نویسندگان
چکیده
We introduce in this paper an exact nonlinear formulation of the multiway cut problem. By simple linearizations of this formulation, we derive several well-known and new formulations for the problem. We further establish a connection between the multiway cut and the maximum-weighted independent set problem. This leads to the study of several instances of the multiway cut problem through the theory of perfect graphs. We also introduce a new randomized rounding argument to study the sharpness of these formulations. © 1999 John Wiley & Sons, Inc. Networks 34: 102–114, 1999
منابع مشابه
Csc5160: Combinatorial Optimization and Approximation Algorithms Topic: Graph Partitioning Problems 18.1 Graph Partitioning Problems 18.1.2 Multiway Cut
This lecture gives a general introduction of graph partitioning problems. We will begin with the definitions of some classic graph partitioning problems (e.g. multiway cut, multicut, sparsest cut), and discuss their relationships. Then we will focus on deriving two approximation algorithms. For the multiway cut problem, we will show a 2-approximation algorithm through a combinatorial argument. ...
متن کاملNonlinear Formations and Improved Randomized Approximation Algorithms for Multiway and Multicut Problems
We introduce nonlinear formulations of the multiway cut and multicut problems. By simple linearizations of these formulations we derive several well known formulations and valid inequalities as well as several new ones. Through these formulations we establish a connection between the multiway cut and the maximum weighted independent set problem that leads to the study of the tightness of severa...
متن کاملLocal Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
We study the approximability of multiway partitioning problems, examples of which include Multiway Cut, Node-weighted Multiway Cut, and Hypergraph Multiway Cut. We investigate these problems from the point of view of two possible generalizations: as Min-CSPs, and as Submodular Multiway Partition problems. These two generalizations lead to two natural relaxations that we call respectively the Lo...
متن کاملCut Problems in Graphs with a Budget Constraint
We study budgeted variants of classical cut problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest c...
متن کاملCs 598csc: Approximation Algorithms 1 the Multicut Problem
In the Multicut problem, we are given a graph G = (V,E), a capacity function that assigns a capacity ce to each edge e, and a set of pairs (s1, t1), ..., (sk, tk). The Multicut problem asks for a minimum capacity set of edges F ⊆ E such that removing the edges in F disconnects si and ti, for all i. Note that the Multicut problem generalizes the Multiway Cut problem that we saw in the last two l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 34 شماره
صفحات -
تاریخ انتشار 1999